Minimum spanning tree analysis of the human connectome
نویسندگان
چکیده
منابع مشابه
4 Minimum Spanning Tree
This first algorithm is quite simple. (Though this was probably known earlier, its proof can be found in Prof. Indyk’s 1999 paper “Sublinear Time Algorithms for Metric Space Problems”.) Let Dij denote the distance between a pair of points i and j, over m total points. The entries of Dij must satisfy the triangle inequality; additionally the matrix is symmetric. Note that the matrix size (i.e., ...
متن کاملProbabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0; 1] and a degree constraint b 2. The aim is to nd a minimum weight spanning tree in which each vertex has degree at most b. In this paper we analyze the probabilistic version of the problem and prove in a rmative the conjecture of Yukich stated in 1998 on the asymptotics of the problem for uni...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملThe Minimum Spanning Tree of Maximum Entropy
In computer vision, we have the problem of creating graphs out of unstructured point-sets, i.e. the data graph. A common approach for this problem consists of building a triangulation which might not always lead to the best solution. Small changes in the location of the points might generate graphs with unstable configurations and the topology of the graph could change significantly. After buil...
متن کاملParallel Minimum Spanning Tree Algorithm
The Minimal Spanning Tree (MST) problem is a classical graph problem which has many applications in various areas. In this paper we discuss a concurrent MST algorithm derived from Prim’s algorithm presented by Setia et al. in 2009, targeting symmetric multiprocessing (SMP) with a shared address space. The pseudocode of the algorithm is presented, combined with three interesting heuristics in or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Human Brain Mapping
سال: 2018
ISSN: 1065-9471,1097-0193
DOI: 10.1002/hbm.24014